Weight hierarchies of binary linear codes of dimension 4
نویسندگان
چکیده
منابع مشابه
Weight hierarchies of binary linear codes of dimension 4
The weight hierarchy of a binary linear [n; k] code C is the sequence (d1; d2; : : : ; dk) where dr is the smallest support of an r-dimensional subcode of C. The codes of dimension 4 are collected in classes. The possible weight hierarchies in each class are given. For one class the details of the proofs are included. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملThe Weight Equations for Binary Linear Codes ∗
The system of weight equations for a binary (n,m)-code with respect to its ordered basis is introduced. It connects certain quantities (characteristics) related to the basis with the weights of non-zero words in the code. It is shown that the portion involving the variables does not depend neither on the code nor on the basis. Explicit forms of the matrix of coefficients in the system and its i...
متن کاملComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملOn the weight distribution of binary linear codes (Corresp.)
Let V be a binary linear (n,k)-code defined by a check matrixHwithcohmmsh,,~~~,h,,,andleth(x)=l ifxE(h,;..,h,),and h(x)=0 if x@{h,;.. ,h,}. A combinatorial argument relates the Walsh transform of h(x) with the weight distribution A(i) of the code V for small i(i< 7). This leads to another proof of the Pless ith power moment identities for i < 7. This relation also provides a simple method for c...
متن کاملOptimal Linear Codes of Dimension 4 over GF(5)
[48] __, " On complexity of trellis structure of linear block codes, " IEEE [49] T. Klgve, " Upperbounds on codes correcting asymmebic errors, " IEEE [SO] __, " Minimum support weights of binary codes, " IEEE Trans. Inform. [53] A. Lafourcade and A. Vardy, " Asymptotically good codes have infinite trellis comwlexitv. " IEEE Duns. issue on " Codes and Finite Geometries "). [59] __, " The shift b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00411-8